#include "graph.h"
#include <iostream>
#include <vector>
#include <list>
using namespace std;
int main(){
    vector<int> _vertex={1,2,3,4};
    int max=4;
    bool flag1=true;
    bool flag2=false;
    graph<int> a(_vertex,max,flag1,flag1);
    graph<int> b(_vertex,max,flag1,flag2);
    graph<int> c(_vertex,max,flag2,flag1);
    a.addedge(edge<int>{1,2,1});
    a.addedge(edge<int>{1,3,2});
    a.addedge(edge<int>{3,2,3});
    a.addedge(edge<int>{4,1,4});
    b.addedge(edge<int>{1,2,1});
    b.addedge(edge<int>{1,3,2});
    b.addedge(edge<int>{3,2,3});
    b.addedge(edge<int>{4,1,4});
    c.addedge(edge<int>{1,2,1});
    c.addedge(edge<int>{1,3,1});
    c.addedge(edge<int>{3,2,1});
    c.addedge(edge<int>{4,1,1});
    a.listEdges();
    a.listVertexes();
    b.listEdges();
    b.listVertexes();
    c.listEdges();
    c.listVertexes();
    return 0;
}